vred: an improvement over red algorithm by using queue length growth velocity

active queue management (aqm) plays an important role in the internet congestion control. it tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. random early detection (red) is the most popular active queue management algorithm that has been implemented in the in internet routers and is trying to supply low delay and low packet loss. red algorithm uses only the average queue length as a congestion meter to trigger packet dropping or packet marking as a congestion feedback. since the average queue length considers only long–term behavior of any queue, this approach fails to see instantaneous changes of the queue length and hence its reaction is not fast enough. this paperincludes another meter i.e. queue length growth velocity to measure congestion level in the router. this leads to fast reaction to the congestion and hence improves the network performance. simulation results show that the proposed algorithm outperforms red algorithm in terms of number of dropped packets and bottleneck utilization.